Boolean circuit - PDFSEARCH.IO - Document Search Engine

Boolean circuit
Results: 103

#	Item
81	How Low Can Approximate Degree and Quantum Query Complexity be for Total Boolean Functions?∗ arXiv:1206.0717v2 [quant-ph] 25 Mar[removed]Andris Ambainis† Add to Reading List Source URL: arxiv.org Language: English - Date: 2013-03-25 21:05:57 Computational complexity theory Quantum information science Analysis of algorithms Quantum algorithm Decision tree model Circuit complexity FO Communication complexity Big O notation Theoretical computer science Applied mathematics Mathematics
82	Formulas Resilient to Short-Circuit Errors Yael Tauman Kalai ∗ Allison Lewko† Add to Reading List Source URL: homes.cs.washington.edu Language: English - Date: 2012-08-18 12:03:13 Quantum information science Quantum complexity theory Circuit Theory of computation Quantum circuit Boolean circuit Communication complexity PP FO Theoretical computer science Applied mathematics Computational complexity theory
83	Indiana Department of Education Academic Standards Course Framework DIGITAL ELECTRONICS Digital Electronics is a course of study in applied digital logic that encompasses the design and application of electronic circuit Add to Reading List Source URL: www.doe.in.gov Language: English - Date: 2014-01-09 10:43:32 Electronic design Algebraic logic Digital electronics Logic gate Electronic circuit Boolean algebra OR gate Electronic engineering Electronics Electromagnetism
84	Indiana Department of Education Academic Standards Course Framework DIGITAL ELECTRONICS (Non-PLTW) Digital Electronics is a course of study in applied digital logic that encompasses the design and application of electron Add to Reading List Source URL: www.doe.in.gov Language: English - Date: 2014-01-09 10:43:32 Electromagnetism Algebraic logic Digital electronics Logic gate Electronic circuit Boolean algebra OR gate Logic level Electronic engineering Electronics Electronic design
85	2 Preliminaries A combinational boolean network is a directed acyclic graph (DAG) with nodes corresponding to logic gates and directed edges corresponding to wires connecting the gates. Incoming edges of a node are calle Add to Reading List Source URL: minisat.se Language: English - Date: 2009-12-31 17:36:11 Electronic engineering Diagrams Circuit Theory of computation Cut And-inverter graph Mathematics Theoretical computer science Graph connectivity Combinatorial optimization
86	Feebly secure cryptographic primitives∗ Edward A. Hirsch Olga Melanich Sergey I. Nikolenko Add to Reading List Source URL: logic.pdmi.ras.ru Language: English - Date: 2012-01-21 00:18:10 Computational complexity theory Linear algebra Matrix theory Matrix Circuit complexity Boolean circuit Circuit Invertible matrix Arithmetic circuit complexity Algebra Theoretical computer science Mathematics
87	Applying Logic Synthesis for Speeding Up SAT Niklas Een, Alan Mishchenko, Niklas S¨ orensson Cadence Berkeley Labs, Berkeley, USA. EECS Department, University of California, Berkeley, USA. Chalmers University of Technol Add to Reading List Source URL: minisat.se Language: English - Date: 2007-05-29 19:29:26 Theoretical computer science Conjunctive normal form And-inverter graph Science Mathematics Circuit Canonical form Boolean network Logic Electronic design automation Formal methods
88	On Proving Circuit Lower Bounds Against PH and Some Related Lower Bounds for Constant Depth Circuits Jin-Yi Cai 1 Add to Reading List Source URL: pages.cs.wisc.edu Language: English - Date: 2003-03-05 08:33:15 Complexity classes Circuit complexity Pseudorandomness Pseudorandom generator theorem PP Pseudorandom generator P NC Boolean circuit Theoretical computer science Computational complexity theory Applied mathematics
89	On the Incompressibility of Monotone DNFs Matthias P. Krieger∗ Johann Wolfgang Goethe-Universit¨at Frankfurt am Main Institut f¨ ur Informatik Lehrstuhl f¨ Add to Reading List Source URL: www.thi.informatik.uni-frankfurt.de Language: English - Date: 2010-11-03 11:40:59 Circuit complexity Computational complexity theory Boolean algebra Complexity classes Implicant Logic in computer science Boolean circuit Circuit ACC0 Theoretical computer science Mathematics Applied mathematics
90	FairplayMP – A System for Secure Multi-Party Computation Assaf Ben-David∗ Noam Nisan∗ Benny Pinkas† Add to Reading List Source URL: www.cs.huji.ac.il Language: English - Date: 2008-09-03 07:33:47 Computing Secure multi-party computation Secure two-party computation Pseudorandom generator Circuit Boolean circuit Transmission Control Protocol Computer Actor model Cryptographic protocols Theoretical computer science Applied mathematics

UPDATE